Encoding Quadrilateral Meshes
نویسندگان
چکیده
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encoding scheme discussed in [1] for quadrilateral mesh connectivity can be improved from 3.5 bits per vertex to less than 3 bits per vertex. We also show that an easy equivalence between the labelling schemes of King et al [2] and of Kronrod-Gotsman [1], improves this further to 2.67 bits per vertex. The same upper bound has also been reported in [2], making an involved use of the CLRES labelling scheme.
منابع مشابه
Encoding Quadrilateral Meshes in 2.40 bits per Vertex
In this note, we show that the encoding scheme discussed in [1] for quadrilateral meshes can be improved to 2.40 bits per vertex, using arithmetic coding. This is a considerable improvement over the current bound of 2.67 bits per vertex.
متن کاملEfficient Face-Based Non-Split Connectivity Compression for Quad and Triangle-Quad Meshes
In this paper we present an efficient face-based connectivity coding technique for the special class of quadrilateral and the hybrid triangular-quadrilateral meshes. This work extends the main ideas of non-split encoding presented by the first contribution of the authors (Khattab, Abd El-Latif, Abdel Wahab and Tolba, 2007) for triangle meshes and improves over the compression results provided s...
متن کاملConnectivity Compression for Irregular Quadrilateral Meshes
Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and VRML models, however, are represented as quadrilateral meshes or mixed triangle/quadrilateral meshes, and these models may also require compression. We prese...
متن کاملParameterization of Quadrilateral Meshes
Low-distortion parameterization of 3D meshes is a fundamental problem in computer graphics. Several widely used approaches have been presented for triangular meshes. But no direct parameterization techniques are available for quadrilateral meshes yet. In this paper, we present a parameterization technique for non-closed quadrilateral meshes based on mesh simplification. The parameterization is ...
متن کاملConstrained quadrilateral meshes of bounded size
We introduce a new algorithm to convert triangular meshes of polygonal regions, with or without holes, into strictly convex quadrilateral meshes of small bounded size. Our algorithm includes all vertices of the triangular mesh in the quadrilateral mesh, but may add extra vertices (called Steiner points). We show that if the input triangular mesh has t triangles, our algorithm produces a mesh wi...
متن کامل